The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite

نویسندگان

  • William B. Johnson
  • Assaf Naor
چکیده

Let X be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer n and any x1, . . . , xn ∈ X there exists a linear mapping L : X → F, where F ⊆ X is a linear subspace of dimension O(log n), such that ‖xi − x j‖ ≤ ‖L(xi) − L(x j)‖ ≤ O(1) · ‖xi − x j‖ for all i, j ∈ {1, . . . , n}. We show that this implies that X is almost Euclidean in the following sense: Every n-dimensional subspace of X embeds into Hilbert space with distortion 22 O(log∗ n) . On the other hand, we show that there exists a normed space Y which satisfies the J-L lemma, but for every n there exists an n-dimensional subspace En ⊆ Y whose Euclidean distortion is at least 2Ω(α(n)), where α is the inverse Ackermann function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

236779: Foundations of Algorithms for Massive Datasets Lecture 4 the Johnson-lindenstrauss Lemma

The Johnson-Lindenstrauss lemma and its proof This lecture aims to prove the Johnson–Lindenstrauss lemma. Since the lemma is proved easily with another interesting lemma, a part of this lecture is focused on the proof of this second lemma. At the end, the optimality of the Johnson–Lindenstrauss lemma is discussed. Lemma 1 (Johnson-Lindenstrauss). Given the initial space X ⊆ R n s.t. |X| = N , <...

متن کامل

Geometric Optimization April 12 , 2007 Lecture 25 : Johnson Lindenstrauss Lemma

The topic of this lecture is dimensionality reduction. Many problems have been efficiently solved in low dimensions, but very often the solution to low-dimensional spaces are impractical for high dimensional spaces because either space or running time is exponential in dimension. In order to address the curse of dimensionality, one technique is to map a set of points in a high dimensional space...

متن کامل

An Elementary Proof of the Johnson-lindenstrauss Lemma

The Johnson-Lindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n== 2) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1). In this note, we prove this lemma using elementary probabilistic techniques.

متن کامل

Hereditary Approximation Property

If X is a Banach space such that the isomorphism constant to `2 from n dimensional subspaces grows sufficiently slowly as n → ∞, then X has the approximation property. A consequence of this is that there is a Banach space X with a symmetric basis but not isomorphic to `2 so that all subspaces of X have the approximation property. This answers a problem raised in 1980 [8]. An application of the ...

متن کامل

The Johnson-Lindenstrauss Lemma Meets Compressed Sensing

We show how two fundamental results in analysis related to n-widths and Compressed Sensing are intimately related to the Johnson-Lindenstrauss lemma. Our elementary approach is based on the same concentration inequalities for random inner products that have recently provided simple proofs of the Johnson-Lindenstrauss lemma. We show how these ideas lead to simple proofs of Kashin’s theorems on w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009